Deterministic and reliability-based design: veneer cover soil stability
نویسندگان
چکیده
منابع مشابه
Deterministic Design, Reliability-Based Design and Robust Design
Due to the inherent uncertainties or variabilities in loads, materials and manufacturing quality, variabilities are unavoidable in structural responses. To ensure the reliability of a structure, these uncertainties or variabilities must be considered during structural design. Through a simple cantilever box beam example, the concepts and practices of three design methodologies: deterministic de...
متن کاملReliability and Reliability-Based Design Optimization
Reliability is often understood as the probability that a structure will not fail to perform its intended function. In this paper, the general formulation of consistent evaluation of the safety of structures and the associated methods of analysis are reviewed. After the reliability analysis of a cantilever beam is demonstrated, the methodology of reliability-based optimization and the related p...
متن کاملRobust Design and Reliability-based Design Optimization
A large number of problems in manufacturing processes, production planning, finance and engineering design require an understanding of potential sources of variations and quantification of the effect of variations on product behavior and performance. Traditionally, in engineering problems uncertainties have been formulated only through coarse safety factors. Such methods often lead to overdesig...
متن کاملNon-Deterministic Finite Cover Automata
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language using a Non-deterministic Finite Automata (NFA) may significantly reduce the number of required states. The combined power of the succinctness of the representation of fin...
متن کاملDeterministic Parameterized Connected Vertex Cover
In the Connected Vertex Cover problem we are given an undirected graph G together with an integer k and we are to find a subset of vertices X of size at most k, such that X contains at least one end-point of each edge and moreover X induces a connected subgraph. For this problem we present a deterministic algorithm running in O(2n) time and polynomial space, improving over previously best O(2.4...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geosynthetics International
سال: 2008
ISSN: 1072-6349,1751-7613
DOI: 10.1680/gein.2008.15.1.1